Fixed-Parameter Approximability and Hardness
نویسنده
چکیده
Fixed parameter approximability and hardness Name: Guy Kortsarz Affil./Addr. Rutgers University, Camden. Supported in part by NSF grant number 1218620
منابع مشابه
Approximability and parameterized complexity of multicover by c-intervals
A c-interval is the disjoint union of c intervals over N. The c-IntervalMulticover problem is the special case of SetMulticover where all sets available for covering are c-intervals. We strengthen known APX-hardness results for c-IntervalMulticover, show W[1]-hardness when parameterized by the solution size, and present fixed-parameter algorithms for alternative parameterizations.
متن کاملFixed Parameter Complexity and Approximability of Norm Maximization
The problem of maximizing the p-th power of a p-norm over a halfspace-presented polytope in Rd is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in [19] that this problem is NP-hard for all values p ∈ N, if the dimension d of the ambient space is part of the input. In this paper, we use the theory of parametrized complexity to analyze ...
متن کاملApproximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the problem to find a maximum-size submatrix of a 0/1-matrix such that the submatrix has the C1P. Moreover, we achieve a proble...
متن کاملApproximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
In this paper, we present a survey of the approximability and fixed-parameter tractability results for some Exemplar Genomic Distance problems. We mainly focus on three problems: the exemplar breakpoint distance problem and its complement (i.e., the exemplar non-breaking similarity or the exemplar adjacency number problem), and the maximal strip recovery (MSR) problem. The following results hol...
متن کاملHow to Cut a Graph into Many Pieces
In this paper we consider the problem of finding a graph separator of a given size that decomposes the graph into the maximum number of connected components. We present the picture of the computational complexity and the approximability of this problem for several natural classes of graphs. We first provide an overview of the hardness of approximation of this problem, which stems mainly from it...
متن کامل